Learning Symbolic Prototypes
نویسندگان
چکیده
We present an empirical analysis of symbolic prototype learners for synthetic and real domains. The prototypes are learned by modifying the minimum-distance classiier to solve problems with symbolic attributes, attribute weighting, and its inability to learn multiple prototypes for a class. These extensions are implemented in SNMC. In the second half of this paper, we provide empirical analysis, characterizing situations where symbolic prototypes have advantages over traditional methods such as decision trees and instance-based methods. Empirical analysis on real domains show that SNMC increases classiication accuracy by 10% over the original minimum-distance classiier and has a higher average generalization accuracy than both C4.5 and PEBLS on 20 domains from the UCI data repository. Finding multiple prototypes for classes results in the same or higher accuracy than learning a single prototype for classes. Submission statement: A portion of this paper overlaps another paper submitted to another conference. If both papers are accepted the overlap will be reduced by referencing the other paper and additional research will be added. The overlap was necessary to explain some of the ideas. Abstract: We present an empirical analysis of symbolic prototype learners for synthetic and real domains. The prototypes are learned by modifying the minimum-distance classiier to solve problems with symbolic attributes, attribute weighting, and its inability to learn multiple prototypes for a class. These extensions are implemented in SNMC. In the second half of this paper , we provide empirical analysis, characterizing situations where symbolic prototypes have advantages over traditional methods such as decision trees and instance-based methods. Empirical analysis on real domains show that SNMC increases classiication accuracy by 10% over the original minimum-distance classiier and has a higher average generalization accuracy than both C4.5 and PEBLS on 20 domains from the UCI data repository. Finding multiple prototypes for classes results in the same or higher accuracy than learning a single prototype for classes.
منابع مشابه
Symbolic Nearest Mean Classifiers
The minimum-distance classifier summarizes each class with a prototype and then uses a nearest neighbor approach for classification. Three drawbacks of the original minimum-distance classifier are its inability to work with symbolic attributes, weigh attributes, and learn more than a single prototype for each class. The proposed solutions to these problems include defining the mean for symbolic...
متن کاملApplication of Symbolic :\tachine Learning to the Recognition of Texture Concepts
This paper presents an approach to the texture recognition problem that deals with noisy learning and testing data. The method incorporates symbolic machine learning to acquire texture descriptions. Then, these descriptions are optimized in order to remove some nOisylimperfect components. We present methodology and experimental results showing the increase in system recognition effectiveness wh...
متن کاملPrototyping Structural Shape Descriptions by Inductive Learning
In this paper, a novel algorithm for learning structured descriptions, ascribable to the category of symbolic techniques, is proposed. It faces the problem directly in the space of the graphs, by defining the proper inference operators, as graph generalization and graph specialization, and obtains general and coherent prototypes with a low computational cost with respect to other symbolic learn...
متن کاملSymbolic Model for Scene Interpretation 2 sensor
The symbolic level of a dynamic scene interpretation system is presented. This symbolic level is based on plan prototypes represented by Petri nets whose interpretation is expressed thanks to 1st order cubes, and on a reasoning aiming at instantiating the plan prototypes with objects delivered by the numerical processing of sensor data. A purely symbolic meta-structure, grounded on the lattice ...
متن کاملA Genetic Prototype Learner
Supervised classification problems have received considerable attention from the machine learning community. We propose a novel genetic algorithm based prototype learning system , PLEASE, for this class of problems. Given a set of prototypes for each of the possible classes, the class of an input instance is determined by the prototype nearest to this instance. We assume ordinal attributes and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997